On Zero-Rate Error Exponents of Finite-State Channels With Input-Dependent States
نویسندگان
چکیده
منابع مشابه
On Two-way AWGN Channel Error Exponents at Zero Rate
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. Achievable error exponent regions of a twoway additive white Gaussian noise (AWGN) channel, where two terminals exchange a fixed number of messages M , are derived. In particular, error exponent regions for M = 2 messages under expected power and M = 3 messages under almost sure power constraints are considered. For M = 2 messages the use of a...
متن کاملThe Zero-Error Feedback Capacity of State-Dependent Channels
The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel’s zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may require more than one channel use. These phenomena do not occur when the state is revealed to the transmitter causally, a case that is solved here using Shannon s...
متن کاملOn Entropy and Lyapunov Exponents for Finite-State Channels
The Finite-State Markov Channel (FSMC) is a time-varying channel having states that are characterized by a finite-state Markov chain. These channels have infinite memory, which complicates their capacity analysis. We develop a new method to characterize the capacity of these channels based on Lyapunov exponents. Specifically, we show that the input, output, and conditional entropies for this ch...
متن کاملOn error exponents for arbitrarily varying channels
The minimum probability of error achievable by random codes on the arbitrarily varying channel (AVC) is investigated. New exponential error bounds are found and applied to the AVC with and without input and state constraints. Also considered is a simple subclass of random codes, called randomly modulated codes, in which encoding and decoding operations are separate from code randomization. A un...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2378259